A Multi-valued Discrete Particle Swarm Optimization for the Evacuation Vehicle Routing Problem
نویسندگان
چکیده
An optimal evacuation route plan has to be established to overcome the problem of poor coordination and uneven distribution of vehicles before or during disaster. This article introduces the evacuation vehicle routing problem (EVRP) as a new variant to the vehicle routing problem (VRP). EVRP is a process of moving vehicles from a vehicle location to the potentially flooded area (PFA), and from PFA to relief center using a number of capacitated vehicles. This paper examines the application of a multi-valued discrete particle swarm optimization (DPSO) for routing of vehicles from vehicle location to PFA. A solution representation is adopted and modified from the solution of the shortest path problem (SPP) to accommodate this problem. Experimental results were tested based on the objective function of finding a minimum total travelling time using datasets from a flash flood evacuation operation. DPSO was found to yield better results than a genetic algorithm (GA).
منابع مشابه
Discrete Particle Swarm Optimization for Solving a Single to Multiple Destinations in Evacuation Planning
During the evacuation process, the most challenging task is to move people to safer locations. As time is the decision factor in the evacuation process, urgent and firmly decisions are required. An evacuation plan should be efficiently constructed by taking into account the routes of vehicle. This paper explored the feasibility of using a discrete particle swarm optimization (DPSO) algorithm to...
متن کاملA particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation
In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...
متن کاملAn Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems
Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...
متن کاملA New Competitive Approach on Multi-Objective Periodic Vehicle Routing Problem
This paper presents a novel multi-objective mathematical model of a periodic vehicle routing problem (PVRP) in a competitive situation for obtaining more sales. In such a situation, the reaching time to customers affects the sale amount therefore, distributors intend to service customers earlier than other rivals for obtaining the maximum sale. Moreover, a partial driver’s benefit is related...
متن کاملExploring Feasible and Infeasible Regions in the Vehicle Routing Problem with Time Windows Using a Multi-objective Particle Swarm Optimization Approach
This paper investigates the ability of a discrete particle swarm optimization algorithm (DPSO) to evolve solutions from infeasibility to feasibility for the Vehicle Routing Problem with Time Windows (VRPTW). The proposed algorithm incorporates some principles from multi-objective optimization to allow particles to conduct a dynamic trade-off between objectives in order to reach feasibility. The...
متن کامل